منابع مشابه
Pseudo-Hamiltonian-connected graphs
Given a graph G and a positive integer k, denote by G[k] the graph obtained from G by replacing each vertex of G with an independent set of size k. A graph G is called pseudo-k Hamiltonian-connected if G[k] is Hamiltonian-connected, i.e., every two distinct vertices of G[k] are connected by a Hamiltonian path. A graph G is called pseudo Hamiltonian-connected if it is pseudo-k Hamiltonian-connec...
متن کاملHamiltonian-connected graphs
For a simple graph G, let NC D(G) = min{|N (u) ∪ N (v)| + d(w) : u, v, w ∈ V (G), uv 6∈ E(G), wv or wu 6∈ E(G)}. In this paper, we prove that if NC D(G) ≥ |V (G)|, then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended. c © 2008 Published by Elsevier Ltd
متن کاملHamiltonian Connected Line Graphs
Thomassen conjectured [8] that every 4-connected line graph is hamiltonian. An hourglass is a graph isomorphic to K5−E(C), where C is a cycle of length 4 in K5. In [2], it is shown that every 4-connected line graph without an induced subgraph isomorphic to the hourglass is hamiltonian connected. In this note, we prove that every 3-connected, essentially 4-connected hourglass-free line graph is ...
متن کامل5-Connected Toroidal Graphs are Hamiltonian-Connected
The problem on the Hamiltonicity of graphs is well studied in discrete algorithm and graph theory, because of its relation to traveling salesman problem (TSP). Starting with Tutte’s result, stating that every 4-connected planar graph is Hamiltonian, several researchers have studied the Hamiltonicity of graphs on surfaces. Extending Tutte’s technique, Thomassen proved that every 4-connected plan...
متن کاملForbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs
For an integer kwith k ≥ 2 and a pair of connected graphs F1 and F2 of order at least three, we say that {F1, F2} is a k-forbidden pair if every k-connected {F1, F2}-free graph, except possibly for a finite number of exceptions, is Hamiltonian. If no exception arises, {F1, F2} is said to be a strong k-forbidden pair. The 2-forbidden pairs and the strong 2-forbidden pairs are determined by Faudr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90058-0